The Hierarchy Theorem for Generalized Quantifiers
نویسندگان
چکیده
The concept of a generalized quantiier of a given similarity type was deened in Lin66]. Our main result says that on nite structures diierent similarity types give rise to diierent classes of generalized quantiiers. More exactly, for every similarity type t there is a generalized quantiier of type t which is not deenable in the extension of rst order logic by all generalized quantiiers of type smaller than t. This was proved for unary similarity types by Per Lindstrr om Wes] with a counting argument. We extend his method to arbitrary similarity types.
منابع مشابه
A double arity hierarchy theorem for transitive closure logic
In this paper we prove that the k–ary fragment of transitive closure logic is not contained in the extension of the (k − 1)–ary fragment of partial fixed point logic by all (2k − 1)–ary generalized quantifiers. As a consequence, the arity hierarchies of all the familiar forms of fixed point logic are strict simultaneously with respect to the arity of the induction predicates and the arity of ge...
متن کاملAN LP-LQ-VERSION OF MORGAN’S THEOREM FOR THE GENERALIZED BESSEL TRANSFORM
n this article, we prove An Lp-Lq-version of Morgan’s theorem for the generalized Bessel transform.
متن کاملGENERALIZED PRINCIPAL IDEAL THEOREM FOR MODULES
The Generalized Principal Ideal Theorem is one of the cornerstones of dimension theory for Noetherian rings. For an R-module M, we identify certain submodules of M that play a role analogous to that of prime ideals in the ring R. Using this definition, we extend the Generalized Principal Ideal Theorem to modules.
متن کاملAn Lp-Lq-version Of Morgan's Theorem For The Generalized Fourier Transform Associated with a Dunkl Type Operator
The aim of this paper is to prove new quantitative uncertainty principle for the generalized Fourier transform connected with a Dunkl type operator on the real line. More precisely we prove An Lp-Lq-version of Morgan's theorem.
متن کاملThe Analytic Polynomial Time Hierarchy
Motivated by results on interactive proof systems we investigate an 9-8-hierarchy over P using word quantifiers as well as two types of set quantifiers. This hierarchy, which extends the (arithmetic) polynomial-time hierarchy, is called the analytic polynomial-time hierarchy. It is shown that every class of this hierarchy coincides with one of the following classes: pk, pk (k 0), PSPACE, exp k ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 61 شماره
صفحات -
تاریخ انتشار 1996